Automated Analysis of MUTEX Algorithms with FASE
نویسندگان
چکیده
منابع مشابه
Automated Analysis of MUTEX Algorithms with FASE
In this paper we study the liveness of several MUTEX solutions by representing them as processes in PAFASs, a CCS-like process algebra with a specific operator for modelling non-blocking reading behaviours. Verification is carried out using the tool FASE, exploiting a correspondence between violations of the liveness property and a special kind of cycles (called catastrophic cycles) in some tra...
متن کاملFuzzy Analysis of Statistical Evidence (FASE)
Fuzzy Analysis of Statistical Evidence (FASE) is utilizing the fuzzy set and the statistical theory for solving problems of pattern recognition and/or classification. Several features of FASE are similar to the human judgment. It can evaluate the weight of statistical evidence (information); it can update inference with new information; and it can incorporate missing data. Furthermore, since it...
متن کاملThe Mutex Paradigm of Concurrency
Concurrency can be studied at different yet consistent levels of abstraction: from individual behavioural observations, to more abstract concurrent histories which can be represented by causality structures capturing intrinsic, invariant dependencies between executed actions, to system level devices such as Petri nets or process algebra expressions. Histories can then be understood as sets of c...
متن کاملComparative Analysis of Machine Learning Algorithms with Optimization Purposes
The field of optimization and machine learning are increasingly interplayed and optimization in different problems leads to the use of machine learning approaches. Machine learning algorithms work in reasonable computational time for specific classes of problems and have important role in extracting knowledge from large amount of data. In this paper, a methodology has been employed to opt...
متن کاملTransactional Mutex Locks
Mutual exclusion (mutex) locks limit concurrency but offer low single-thread latency. Software transactional memory (STM) typically has much higher latency, but scales well. We present transactional mutex locks (TML), which attempt to achieve the best of both worlds for read-dominated workloads. We also propose compiler optimizations that reduce the latency of TML to within a small fraction of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.54.4